Convergence of Logarithmic Return Times
نویسنده
چکیده
Foreword The last nine months of my study were dedicated to writing this master thesis. After having determined that I wanted it to be based on the course of Ergodic Theory, that I took in the first semester of the academic year 2003/2004, Karma Dajani suggested the subject of repetitions in number expansions. The subject interested me right from the start. Since in general writing my master thesis has been a nice experience, I would like to thank a few people who made this possible. First of all, I would like to thank my supervisor, Karma Dajani, for all the time and effort she put into discussing with me, advising me and correcting me. Without her help I'm sure writing my master thesis would have been much more stressful and difficult. I would also like to thank Byong Ki Seo for the time he took to explain to me parts of his doctoral thesis. Furthermore, I would like to thank all my friends for their support, especially in the last two months of the process and in particular I would like to thank Maarten van Pruijssen, who, besides moral support, also provided me with mathematical advise during our morning coffees and studying sessions. And finally I would like to thank my family and especially my parents for having an endless amount of faith in me.
منابع مشابه
On the Convergence of Logarithmic First Return Times
Let T be an ergodic transformation on X and {αn} a sequence of partitions on X. Define Kn(x) = min{j ≤ 1 : T x ∈ αn(x)}, where αn(x) is the element of αn containing x. In this paper we give conditions on T and αn, for which limn→∞ log Kn(x) n exists. We study the question in one and higher dimensions.
متن کاملA Monotonicity in Reversible Markov Chains
In this paper we identify a monotonicity in all countable-state-space reversible Markov chains and examine several consequences of this structure. In particular, we show that the return times to every state in a reversible chain have a decreasing hazard rate on the subsequence of even times. This monotonicity is used to develop geometric convergence rate bounds for time-reversibleMarkov chains....
متن کاملThe Eyring-Kramers formula for Poincaré and logarithmic Sobolev inequalities
The topic of this thesis is a diffusion process on a potential landscape which is given by a smooth Hamiltonian function in the regime of small noise. The work provides a new proof of the Eyring-Kramers formula for the Poincaré inequality of the associated generator of the diffusion. The Poincaré inequality characterizes the spectral gap of the generator and establishes the exponential rate of ...
متن کاملLogarithmic density and logarithmic statistical convergence
In this paper we use the idea of logarithmic density to define the concept of logarithmic statistical convergence. We find the relations of logarithmic statistical convergence with statistical convergence, statistical summability (H, 1) introduced by Móricz (Analysis 24:127-145, 2004) and [H, 1]q-summability. We also give subsequence characterization of statistical summability (H, 1). MSC: 40A0...
متن کاملBreaking the Duality in the Return times Theorem
We prove Bourgain’s Return Times Theorem for a range of exponents p and q that are outside the duality range. An oscillation result is used to prove hitherto unknown almost everywhere convergence for the signed average analog of Bourgain’s averages.
متن کاملTesting the Irreversibility of a Gibbsian Process via Hitting and Return times (running Title: Entropy Production via Hitting and Return Times)
We introduce estimators for the entropy production of a Gibbsian process based on the observation of a single or two typical trajectories. These estimators are built with adequate hitting and return times. We then study their convergence and fluctuation properties. This provides statis-ticals test for the irreversibility of Gibbsian processes.
متن کامل